منابع مشابه
Routing Games
This chapter studies the inefficiency of equilibria in noncooperative routing games, in which selfinterested players route traffic through a congested network. Our goals are threefold: to introduce the most important models and examples of routing games; to survey optimal bounds on the price of anarchy in these models; and to develop proof techniques that are useful for bounding the inefficienc...
متن کاملQuantum Games and Quantum Strategies
One might wonder what games and physics could have possibly in common. After all, games like chess or poker seem to heavily rely on bluffing, guessing and other activities of unphysical character. Yet, as was shown by von Neumann and Morgenstern [1], conscious choice is not essential for a theory of games. At the most abstract level, game theory is about numbers that entities are efficiently ac...
متن کاملQuantum Games and Quantum Algorithms
A quantum algorithm for an oracle problem can be understood as a quantum strategy for a player in a two-player zero-sum game in which the other player is constrained to play classically. I formalize this correspondence and give examples of games (and hence oracle problems) for which the quantum player can do better than would be possible classically. The most remarkable example is the Bernstein...
متن کاملBottleneck Routing Games on Grids
We consider routing games on grid network topologies. The social cost is the worst congestion in any of the network edges (bottleneck congestion). Each player’s objective is to find a path that minimizes the bottleneck congestion in its path. We show that the price of anarchy in bottleneck games in grids is proportional to the number of bends β that the paths are allowed to take in the grids’ s...
متن کاملBicriteria Optimization in Routing Games
Two important metrics for measuring the quality of routing paths are the maximum edge con-gestion C and maximum path length D. Here, we study bicriteria in routing games where eachplayer i selfishly selects a path that simultaneously minimizes its maximum edge congestion Ciand path length Di. We study the stability and price of anarchy of two bicriteria games:• Max games, where ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Physics A: Mathematical and Theoretical
سال: 2018
ISSN: 1751-8113,1751-8121
DOI: 10.1088/1751-8121/aae31f